CHARACTERIZATIONS ON CHAIN RECURRENCES

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two characterizations of chain partitioned probe graphs

Chain graphs are exactly bipartite graphs without induced 2K 2 (a graph with four vertices and two disjoint edges). A graph G = (V, E) with a given independent set S ⊆ V (a set of pairwise non-adjacent vertices) is said to be a chain partitioned probe graph if G can be extended to a chain graph by adding edges between certain vertices in S. In this note we give two characterizations for chain p...

متن کامل

Cost Characterizations of Supply Chain Delivery Performance

This paper addresses strategies for improving delivery performance in a serial supply chain when delivery performance is evaluated with respect to a delivery window. Contemporary management theories advocate the reduction of variance as a key step in improving the overall performance of a system. Models are developed that incorporate the variability found in the individual stages of the supply ...

متن کامل

ON r-ORDER RECURRENCES*

with initial terms u0 ux = ••• = ur_2 = 0, ur_1 1. Then (u) is called a unit sequence with coefficients al5 a25 -.., ar. For a positive integer AT, the primitive period of (u) modulo AT, denoted by K(M), is the least positive integer m such that un + m = un (mod AT) for all nonnegative integers n greater than or equal to some fixed integer n0. It is known that the primitive period modulo M of a...

متن کامل

On Lacunary Recurrences

Let {an}^_ao be a sequence which satisfies a linear recurrence of order k +1. We are herein concerned with the lacunary subsequences {®mn+b}Z=-ao> where m and b are fixed integers, so called because they consist of the terms from {aJ with lacunae, or gaps, of length m between them. In [5], [2], and [3] it has been shown that, for any m and A, the subsequences {amn+b} also satisfy a linear recur...

متن کامل

On Recurrences for Ising Integrals

We use WZ-summation methods to compute recurrences for the Ising-class integrals Cn,k. In this context, we describe an algorithmic approach to obtain homogeneous and inhomogeneous recurrences for a general class of multiple contour integrals of Barnes’ type.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Korean Mathematical Society

سال: 2010

ISSN: 1015-8634

DOI: 10.4134/bkms.2010.47.2.287